Nonseparating Planar Chains in 4-Connected Graphs
نویسندگان
چکیده
In this paper, we describe an O(|V (G)|) algorithm for finding a “non-separating planar chain” in a 4-connected graph G, which will be used to decompose an arbitrary 4-connected graph into “planar chains”. This work was motivated by the study of a multi-tree approach to reliability in distributed networks, as well as the study of non-separating induced paths in highly connected graphs. Supported by CNPq (Proc: 200611/00-3). Partially supported by NSF grant DMS 9970527
منابع مشابه
A 9k Kernel for Nonseparating Independent Set in Planar Graphs
We study kernelization (a kind of efficient preprocessing) for NP-hard problems on planar graphs. Our main result is a kernel of size at most 9k vertices for the Planar Maximum Nonseparating Independent Set problem. A direct consequence of this result is that Planar Connected Vertex Cover has no kernel with at most (9/8 − ǫ)k vertices, for any ǫ > 0, assuming P 6= NP. We also show a very simple...
متن کاملChain Decompositions of 4-Connected Graphs
In this paper we give a decomposition of a 4-connected graph G into nonseparating chains, which is similar to an ear decomposition of a 2-connected graph. We also give an O(|V (G)||E(G)|) algorithm that constructs such a decomposition. In applications, the asymptotic performance can often be improved to O(|V (G)|). This decomposition will be used to find four independent spanning trees in a 4co...
متن کاملShortest Co-cycle Bases of Graphs
In this paper we investigate the structure of the shortest co-cycle base(or SCB in short) of connected graphs, which are related with map geometries, i.e., Smarandache 2dimensional manifolds. By using a Hall type theorem for base transformation, we show that the shortest co-cycle bases have the same structure (there is a 1-1 correspondence between two shortest co-cycle bases such that the corre...
متن کاملNonseparating Cycles in 4-Connected Graphs
We prove that given any fixed edge ra in a 4-connected graph G, there exists a cycle C through ra such that G − (V (C) − {r}) is 2-connected. This will provide the first step in a decomposition for 4-connected graphs. We also prove that for any given edge e in a 5-connected graph G there exists an induced cycle C through e in G such that G−V (C) is 2-connected. This provides evidence for a conj...
متن کاملSufficient conditions for the non-separating paths
For two vertices in a graph, a path between them is non-separating if the remaining graph is connected. A previous work shows that a nonseparating path always exists if the connectivity is more than two. In this paper, we show that to determine if there is a non-separating path is NPcomplete for graphs of connectivity one or two. Sufficient conditions for the existence of a nonseparating path o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 19 شماره
صفحات -
تاریخ انتشار 2005